A Monotonicity Principle for Information Theory
نویسندگان
چکیده
منابع مشابه
A Monotonicity Principle for Information Theory
We establish a monotonicity principle for convex functions that enables high-level reasoning about capacity in information theory. Despite its simplicity, this single idea is remarkably applicable. It leads to a significant extension of algebraic information theory, a solution of the capacity reduction problem, intuitive graphical methods for comparing channels, new inequalities that provide us...
متن کاملMonotonicity and the Pareto Principle
The property of monotonicity, th criterion of (first-degree) income dominance and the Pareto principle appear frequently in the literature on the axiomatic approach to the welfare economics of income distribution. Sometimes these are regarded as almost interchangeable for practical purposes. However, as we shall show, this interchangeability arises because of other important assumptions that ar...
متن کاملEvaluating Matching Algorithms: the Monotonicity Principle
In this paper we present the monotonicity principle, a sufficient condition to ensure that exact mapping, a mapping as would be performed by a human observer, is ranked close to the best mapping, as generated automatically by a matching algorithm. The research is motivated by the introduction of the semantic Web vision and the shift towards machine understandable Web resources. We support the i...
متن کاملGroups, information theory, and Einstein's likelihood principle.
We propose a unifying picture where the notion of generalized entropy is related to information theory by means of a group-theoretical approach. The group structure comes from the requirement that an entropy be well defined with respect to the composition of independent systems, in the context of a recently proposed generalization of the Shannon-Khinchin axioms. We associate to each member of a...
متن کاملDiscrete Monotonicity Principle for Numerical Solutions of Obstacle Problems
A new monotonicity principle and an L stability theorem are es tablished for a discrete obstacle problem which is de ned by a piece wise linear nite element discretization of a continuous problem This discrete monotonicity principle extends the discrete maximum princi ple of Ciarlet from linear equations to obstacle problems As an application of the monotonicity principle and the L stability th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2008
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2008.10.008